Unrestricted resolution versus N-resolution
نویسندگان
چکیده
منابع مشابه
Pronominal Anaphora Resolution for Unrestricted Text
The paper presents an anaphora resolution algorithm for unrestricted text. In particular, we examine portability of a knowledge-based approach of (Mitamura et al., 2002), proposed for a domain-specific task. We obtain up to 70% accuracy on unrestricted text, which is a significant improvement (almost 20%) over a baseline we set for general text. As the overall results leave much room for improv...
متن کاملUnrestricted Coreference Resolution via Global Hypergraph Partitioning
We present our end-to-end coreference resolution system, COPA, which implements a global decision via hypergraph partitioning. In constrast to almost all previous approaches, we do not rely on separate classification and clustering steps, but perform coreference resolution globally in one step. COPA represents each document as a hypergraph and partitions it with a spectral clustering algorithm....
متن کاملCooperation between Pronoun and Reference Resolution for Unrestricted Texts
Anaphora resolution is envisaged in this paper as part of the reference resolution process. A general open architecture is proposed, which can be particularized and configured in order to simulate some classic anaphora resolution methods. With the aim of improving pronoun resolution, the system takes advantage of elementary cues about characters of the text, which are represented through a part...
متن کاملCoherence versus interferometric resolution
Coherence is a key concept in optics derived from the statistical nature of real light beams [1–3]. Coherence is usually understood as the principal requisite for good quality interference fringes. In this work we show from a quantum metrological perspective that this is not always the case, so that optimum interference and second-order coherence may become antithetical. More specifically, we f...
متن کاملUnrestricted race: A new model of syntactic ambiguity resolution
In this chapter, we focus on a previously ignored aspect of sentence processing theories: is processing difficulty caused by reanalysis or competition? According to two-stage theories (e.g., Frazier, 1979; Rayner, Frazier, & Carlson, 1983), reanalysis should occur when an initially adopted reading is inappropriate. In contrast, current constraint-based theories (e.g., MacDonald, 1994; McRae, Sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90216-3